#include <bits/stdc++.h>
using namespace std;
#define N 10005 
template<class T>
class Queue
{
private:
	int que[N], head, tail;
public:
	Queue()
	{
		head = tail = 0;
	}
	void push(T a)
	{
		que[++tail] = a;
	}
	void pop()
	{
		++head;
	}
	T front()
	{
		return que[head+1];
	}
	T back()
	{
		return que[tail];
	}
	bool empty()
	{
		return head == tail;
	}
	int size()
	{
		return tail - head;
	}
};

int main()
{
    Queue<int> que;
    int n;
    cin >> n;
	for(int i = 1; i <= n; ++i)
		que.push(i);
	while(que.empty() == false)
	{
		cout << que.front() << ' ';
		que.pop();
	}
    return 0;
}
